Householder triangularization of a quasimatrix
نویسندگان
چکیده
A standard algorithm for computing the QR factorization of a matrix A is Householder triangularization. Here this idea is generalized to the situation in which A is a quasimatrix, that is, a “matrix” whose “columns” are functions defined on an interval [a,b]. Applications are mentioned to quasimatrix leastsquares fitting, singular value decomposition, and determination of ranks, norms, and condition numbers, and numerical illustrations are presented using the chebfun system.
منابع مشابه
Triangularization over finite-dimensional division rings using the reduced trace
In this paper we study triangularization of collections of matrices whose entries come from a finite-dimensional division ring. First, we give a generalization of Guralnick's theorem to the case of finite-dimensional division rings and then we show that in this case the reduced trace function is a suitable alternative for trace function by presenting two triangularization results. The first one...
متن کاملThe Effectiveness of Psychological Empowerment on the Improvement of Well-Being and Quality of Life in Householder Women
Introduction: In addition to economic problems, householder females, are suffered from divorce, death, disability or addiction of their husbands; and so they are considered among the most vulnerable population. This research aimed to assess the effect of psychological empowerment training on psychological well-being and quality of life of householder women. Methods: The method of this study is...
متن کاملContinuous analogues of matrix factorizations.
Analogues of singular value decomposition (SVD), QR, LU and Cholesky factorizations are presented for problems in which the usual discrete matrix is replaced by a 'quasimatrix', continuous in one dimension, or a 'cmatrix', continuous in both dimensions. Two challenges arise: the generalization of the notions of triangular structure and row and column pivoting to continuous variables (required i...
متن کاملEvaluation of Sylvester type determinants using block-triangularization
It is shown that the values of Sylvester type determinants for various orthogonal polynomials considered by Askey in [1] can be ascertained inductively using simple block-triangularization schemes.
متن کاملOpenMP Implementation of the Householder Reduction for Large Complex Hermitian Eigenvalue Problems
The computation of the complete spectrum of a complex Hermitian matrix typically proceeds through a Householder step. If only eigenvalues are needed, this Householder step needs almost the complete CPU time. Here we report our own parallel implementation of this Householder step using different variants of C and OpenMP. As far as we are aware, this is the only existing parallel implementation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008